- complexity factor
- показатель сложности
English-Russian dictionary of computer science and programming. 2013.
complexity factor
Смотреть что такое "complexity factor" в других словарях:
Complexity (journal) — Discipline Complex Systems … Wikipedia
Complexity — For other uses, see Complexity (disambiguation). In general usage, complexity tends to be used to characterize something with many parts in intricate arrangement. The study of these complex linkages is the main goal of complex systems theory. In… … Wikipedia
complexity — /keuhm plek si tee/, n., pl. complexities for 2. 1. the state or quality of being complex; intricacy: the complexity of urban life. 2. something complex: the complexities of foreign policy. [1715 25; COMPLEX + ITY] * * * ▪ scientific theory… … Universalium
Nelson complexity index — The Nelson complexity index was developed by Wilbur L. Nelson in a series of articles in Oil Gas Journal in 1960 61 (Mar. 14, p. 189; Sept. 26, p. 216; and June 19, p. 109). In 1976, he elaborated on the concept in another series… … Wikipedia
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
Irreducible complexity — This article covers irreducible complexity as used by those who argue for intelligent design. For information on irreducible complexity as used in Systems Theory, see Irreducible complexity (Emergence). Irreducible complexity (IC) is an argument… … Wikipedia
Specified complexity — Part of a series of articles on Intelligent design … Wikipedia
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia
NP (complexity) — Diagram of complexity classes provided that P ≠ NP. The existence of problems outside both P and NP complete in this case was established by Ladner.[1] In computational complexity theory, NP is one of the most fundamental complexity classes. The… … Wikipedia
Reduction (complexity) — Example of a reduction from a boolean satisfiability problem to a vertex cover problem. Blue vertices form a vertex cover which corresponds to truth values. In computability theory and computational complexity theory, a reduction is a… … Wikipedia
Chain rule for Kolmogorov complexity — The chain rule for Kolmogorov complexity is an analogue of the chain rule for information entropy, which states: H(X,Y) = H(X) + H(Y | X) That is, the combined randomness of two sequences X and Y is the sum of the randomness of X plus whatever… … Wikipedia
